Complexity of two dual criteria scheduling problemsYUMEI HUO; LEUNG, J. Y.-T; HAIRONG ZHAO et al.Operations research letters. 2007, Vol 35, Num 2, pp 211-220, issn 0167-6377, 10 p.Article

Inapproximability results for set splitting and satisfiability problems with no mixed clausesGURUSWAMI, V.Lecture notes in computer science. 2000, pp 155-166, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruptionJINJIANG YUAN; YUNDONG MU.European journal of operational research. 2007, Vol 182, Num 2, pp 936-944, issn 0377-2217, 9 p.Article

The maximum residual flow problem : NP-hardness with two-arc destructionDONGLEI DU; CHANDRASEKARAN, R.Networks (New York, NY). 2007, Vol 50, Num 3, pp 181-182, issn 0028-3045, 2 p.Article

On the complexity of unsigned translocation distanceZHU, Darning; LUSHENG WANG.Theoretical computer science. 2006, Vol 352, Num 1-3, pp 322-328, issn 0304-3975, 7 p.Article

Finding the Minimum Number of Face Guards is NP-HardIWAMOTO, Chuzo; KITAGAKI, Yusuke; MORITA, Kenichi et al.IEICE transactions on information and systems. 2012, Vol 95, Num 11, pp 2716-2719, issn 0916-8532, 4 p.Article

Reasoning about cardinal directions between extended objects: The NP-hardness resultLIU, Weiming; LI, Sanjiang.Artificial intelligence (General ed.). 2011, Vol 175, Num 18, pp 2155-2169, issn 0004-3702, 15 p.Article

Improved Bound on Approximating Jug Measuring ProblemSHIEH, Min-Zheng; TSAI, Shi-Chun.Journal of information science and engineering. 2011, Vol 27, Num 3, pp 1159-1163, issn 1016-2364, 5 p.Article

Inapproximability of the Minimum Biclique Edge Partition Problem : Foundations of Computer ScienceOTSUKI, Hideaki; HIRATA, Tomio.IEICE transactions on information and systems. 2010, Vol 93, Num 2, pp 290-292, issn 0916-8532, 3 p.Article

The shortest path improvement problems under Hamming distanceBINWU ZHANG; JIANZHONG ZHANG; LIQUN QI et al.Journal of combinatorial optimization. 2006, Vol 12, Num 4, pp 351-361, issn 1382-6905, 11 p.Article

Minimum Vertex Blocker Clique ProblemFOAD MAHDAVI PAJOUH; BOGINSKI, Vladimir; PASILIAO, Eduardo L et al.Networks (New York, NY). 2014, Vol 64, Num 1, pp 48-64, issn 0028-3045, 17 p.Article

The Status of the P versus NP ProblemFORTNOW, Lance.Communications of the ACM. 2009, Vol 52, Num 9, pp 78-86, issn 0001-0782, 9 p.Article

Approximation algorithms for spreading pointsCABELLO, Sergio.Journal of algorithms (Print). 2007, Vol 62, Num 2, pp 49-73, issn 0196-6774, 25 p.Article

Matching points with rectangles and squaresBEREG, Sergey; MUTSANAS, Nikolaus; WOLFF, Alexander et al.Lecture notes in computer science. 2006, pp 177-186, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 10 p.Conference Paper

Approximation schemes for geometric NP-hard problems: A surveyARORA, Sanjeev.Lecture notes in computer science. 2001, pp 16-17, issn 0302-9743, isbn 3-540-43002-4Conference Paper

Un algorithme à un million de dollars ? = An algorithm of a million of dollars ?DELAHAYE, Jean-Paul.Pour la science. 2005, Num 334, pp 90-95, issn 0153-4092, 6 p.Article

A MCS-RSM approach for network reliability to minimise the total costYEH, Wei-Chang.International journal, advanced manufacturing technology. 2003, Vol 22, Num 9-10, pp 681-688, issn 0268-3768, 8 p.Article

Approximation algorithms for some clustering and classification problemsTARDOS, E.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-66916-7, p. 183Conference Paper

Complexity of the min-max (regret) versions of cut problemsAISSI, Hassene; BAZGAN, Cristina; VANDERPOOTEN, Daniel et al.Lecture notes in computer science. 2005, pp 789-798, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Rounding to an integral programHASSIN, Refael; SEGEV, Danny.Lecture notes in computer science. 2005, pp 44-54, issn 0302-9743, isbn 3-540-25920-1, 11 p.Conference Paper

NP-hard sets are superterse unless NP is smallWANG, Y.Information processing letters. 1997, Vol 61, Num 1, pp 1-6, issn 0020-0190Article

Exact Exponential AlgorithmsFOMIN, Fedor V; KASKI, Petteri.Communications of the ACM. 2013, Vol 56, Num 3, pp 80-88, issn 0001-0782, 9 p.Article

Easy and difficult objective functions for max cutMCCORMICK, S. Thomas; RAO, M. R; RINALDI, Giovanni et al.Mathematical programming. 2003, Vol 94, Num 2-3, pp 459-466, issn 0025-5610, 8 p.Conference Paper

Tetris is hard, even to approximateDEMAINE, Erik D; HOHENBERGER, Susan; LIBEN-NOWELL, David et al.Lecture notes in computer science. 2003, pp 351-363, issn 0302-9743, isbn 3-540-40534-8, 13 p.Conference Paper

Two-Server Network Disconnection ProblemCHOI, Byung-Cheon; HONG, Sung-Pil.Lecture notes in computer science. 2006, pp 785-792, issn 0302-9743, isbn 3-540-34070-X, 8 p.Conference Paper